Spaced repetition

Spaced repetition is a learning technique that incorporates increasing intervals of time between subsequent review of previously learned material; this exploits the psychological spacing effect. Alternative names include spaced rehearsal, expanding rehearsal, graduated intervals, repetition spacing, repetition scheduling, spaced retrieval and expanded retrieval.[1]

Although the principle finds use in many contexts, spaced repetition is commonly applied in contexts in which a learner must acquire a large number of items and retain them indefinitely in memory. Hence, it is well suited for the problem of vocabulary acquisition in the course of second language learning due to the usually enormous size of a given language's inventory of open-class words.

Contents

Research and Applications

The notion that spaced repetition could be used for improving learning was first proposed in the book Psychology of Study by Prof. C. A. Mace in 1932. In 1939, Spitzer tested the effects of a type of spaced repetition on 6th Graders in Iowa to learn science facts.[2] Spitzer tested over 3600 students in Iowa and showed that spaced repetition was effective. This early work went unnoticed and the field was relatively quiet until the late 1960s when cognitive psychologists, notably including Landuaer & Bjork[3] and Melton,[4] explored manipulation of repetition timing as a means to improve recall. Around the same time, Pimsleur language courses pioneered the practical application of spaced repetition theory to language learning and in 1973, Sebastian Leitner devised his "Leitner system", an all-purpose spaced repetition learning system based on flashcards.

At the time, spaced repetition learning was principally being implemented via flashcard systems; these systems were somewhat unwieldy since any significant study base requires many thousands of flashcards. With the increase in accessibility of personal computing, spaced repetition began to be implemented with computer-assisted language learning software-based solutions in the 1980s. The aim of these programs was to tailor the repetition spacing based on learner performance.[5] To enable the user to reach a target level of achievement (e.g. 90% of all material correctly recalled at any given time point), the software adjusts the repetition spacing interval. Material that is hard is shown more often and material that is easy is shown less often, with hard or easy being defined by the ease with which the user is able to produce a correct response.

There are several families of algorithms for scheduling spaced repetition:

Some have theorized that the precise length of intervals does not have a great impact on algorithm effectiveness,[6][7] although it has been suggested by others that the interval (expanded vs. fixed interval, etc.) is quite important; the experimental data regarding this point are mixed.[8]

Pimsleur's graduated-interval recall

Graduated-interval recall is a type of spaced repetition published by Paul Pimsleur in 1967.[9] It is used in the Pimsleur language learning system and it is particularly suited to programmed audio instruction due to the very short times (measured in seconds or minutes) between the first few repetitions, unlike other forms of spaced repetition which may not require such precise timings.

The intervals published in his paper were: 5 seconds, 25 seconds, 2 minutes, 10 minutes, 1 hour, 5 hours, 1 day, 5 days, 25 days, 4 months, 2 years.

By timing a Pimsleur language program with a stopwatch, it is possible to verify that the intervals are not followed exactly but have upper and lower bounds. A similar principle (graduated intervals with upper and lower bounds) is used in at least one open source software project (Gradint) to schedule its audio-only lessons.

Prominent researchers

Prominent practitioners

Software

Most programs are modeled after the manual style of learning with flashcards: items to memorize are entered into the program as question-answer pairs; when a pair is due to be reviewed, the question is displayed on screen, and the user must attempt to remember the answer; when the user has succeeded or failed, the answer is manually revealed, and then tells the program how easily he recalled the answer or failed to. The program schedules pairs based on spaced repetition algorithms. Without a program the user has to schedule flashcards; this takes time and restricts to simple algorithms like the Leitner system.

Further refinements are found:

Some Implementations:

The above list is not comprehensive, nor does it intend to be. The list of flashcard software provides a broader overview.

Further reading

References

  1. ^ "Human Memory: Theory and Practice", Alan D. Baddeley, 1997
  2. ^ Spitzer, H. F. (1939). Studies in retention. Journal of Educational Psychology, 30, 641–657.
  3. ^ Landauer, T. K., & Bjork, R. A. (1978). Optimum rehearsal patterns and name learning. In M. Gruneberg, P. E. Morris, & R. N. Sykes (Eds.), Practical aspects of memory (pp. 625–632). London: Academic Press.
  4. ^ Melton, A. W. (1970). The situation with respect to the spacing of repetitions and memory. Journal of Verbal Learning and Verbal Behavior, 9, 596–606.
  5. ^ See #Software
  6. ^ Cull, W. L. (2000). Untangling the benefits of multiple study opportunities and repeated testing for cued recall. Applied Cognitive Psychology, 14, 215–235.
  7. ^ Peter Bienstman on Mnemosyne mailing list, May 2008
  8. ^ Chapter 6:Is Expanded Retrieval Practice a Superior Form of Spaced Retrieval?, A Critical Review of the Extant Literature, DAVID A. BALOTA, JANET M DUCHEK, and JESSICA M. LOGAN
  9. ^ Pimsleur, Paul (February 1967). "A Memory Schedule". The Modern Language Journal (Blackwell Publishing) 51 (2): 73–75. doi:10.2307/321812. JSTOR 321812